10 research outputs found

    Routing Optimizing Decisions in MANET: The Enhanced Hybrid Routing Protocol (EHRP) with Adaptive Routing based on Network Situation

    Get PDF
    Mobile ad hoc networks (MANETs) are wireless networks that operate without a fixed infrastructure or base station. In MANETs, each node acts as a data source and a router, establishing connections with its neighboring nodes to facilitate communication. This research has introduced the Enhanced Hybrid Routing Protocol (EHRP), which combines the OLSR, AOMDV, and AODV routing protocols while considering the network situation for improved performance. The EHRP protocol begins by broadcasting a RREP (Route Reply) packet to discover a route. The selection of routing options is based on the current network situation. To determine the distance between the source and destination nodes, the proposed EHRP initiates a RREQ (Route Request) packet. In situations where network mobility exceeds the capabilities of the AODV protocol, the EHRP protocol can utilize the OLSR routing protocol for route selection and data transmission, provided that at least 70% of the network nodes remain stable. Additionally, the EHRP protocol effectively handles network load and congestion control through the utilization of the AOMDV routing protocol. Compared to the hybrid routing protocol, the enhanced hybrid routing protocol (EHRP) demonstrates superior performance. Its incorporation of the OLSR, AOMDV, and AODV protocols, along with its adaptive routing adaptation based on network conditions, allows for efficient network management and improved overall network performance. The analysis of packet delivery ratio for EHRP and ZRP reveals that EHRP achieves a packet delivery ratio of 98.01%, while ZRP achieves a packet delivery ratio of 89.99%. These results indicate that the enhanced hybrid routing protocol (EHRP) outperforms the hybrid routing protocol (ZRP) in terms of packet delivery ratio. EHRP demonstrates a higher level of success in delivering packets to their intended destinations compared to ZRP. The analysis of normal routing load for EHRP and ZRP reveals that EHRP exhibits a normal routing load of 0.13%, while ZRP exhibits a higher normal routing load of 0.50%. Based on these results, it can be concluded that the performance of the Enhanced Hybrid Routing Protocol (EHRP) is significantly better than that of the Hybrid Routing Protocol (ZRP) when considering the normal routing load. EHRP demonstrates a lower level of routing overhead and more efficient resource utilization compared to ZRP in scenarios with normal routing load. When comparing the average end-to-end delay between the Enhanced Hybrid Routing Protocol (EHRP) and ZRP, the analysis reveals that EHRP achieves an average delay of 0.06, while ZRP exhibits a higher average delay of 0.23. These findings indicate that the Enhanced Hybrid Routing Protocol (EHRP) performs better than ZRP in terms of average end-to-end delay. EHRP exhibits lower delay, resulting in faster and more efficient transmission of data packets from source to destination compared to ZRP. After considering the overall parameter matrix, which includes factors such as normal routing load, data send and receive throughput, packet delivery ratio, and average end-to-end delay, it becomes evident that the performance of the Enhanced Hybrid Routing Protocol (EHRP) surpasses that of the current hybrid routing protocol (ZRP). Across these metrics, EHRP consistently outperforms ZRP, demonstrating superior performance and efficiency. The Enhanced Hybrid Routing Protocol (EHRP) exhibits better results in terms of normal routing load, higher throughput for data transmission and reception, improved packet delivery ratio, and lower average end-to-end delay. Overall, EHRP offers enhanced performance and effectiveness compared to the existing hybrid routing protocol (ZRP)

    Performance analysis and implementation of proposed mechanism for detection and prevention of security attacks in routing protocols of vehicular ad-hoc network (VANET)

    Get PDF
    Next-generation communication networks have become widely popular as ad-hoc networks, broadly categorized as the mobile nodes based on mobile ad-hoc networks (MANET) and the vehicular nodes based vehicular ad-hoc networks (VANET). VANET is aimed at maintaining safety to vehicle drivers by begin autonomous communication with the nearby vehicles. Each vehicle in the ad-hoc network performs as an intelligent mobile node characterized by high mobility and formation of dynamic networks. The ad-hoc networks are decentralized dynamic networks that need efficient and secure communication requirements due to the vehicles being persistently in motion. These networks are more susceptible to various attacks like Warm Hole attacks, denial of service attacks and Black Hole Attacks. The paper is a novel attempt to examine and investigate the security features of the routing protocols in VANET, applicability of AODV (Ad hoc On Demand) protocol to detect and tackle a particular category of network attacks, known as the Black Hole Attacks. A new algorithm is proposed to enhance the security mechanism of AODV protocol and to introduce a mechanism to detect Black Hole Attacks and to prevent the network from such attacks in which source node stores all route replies in a look up table. This table stores the sequences of all route reply, arranged in ascending order using PUSH and POP operations. The priority is calculated based on sequence number and discard the RREP having presumably very high destination sequence number. The result show that proposed algorithm for detection and prevention of Black Hole Attack increases security in Intelligent Transportation System (ITS) and reduces the effect of malicious node in the VANET. NCTUNs simulator is used in this research work

    Cryptography-Based Efficient Secured Routing Algorithm for Vehicular Ad Hoc Networks

    No full text
    There exist certain challenges like high overhead, poor performance, and detection of malicious nodes in the vehicular ad hoc network. For improvement in security and performance, an algorithm is proposed and named as efficient secure routing algorithm (ESRA), which is based on a dual authentication scheme having a moderate level of time and space complexities. The proposed algorithm is implemented in two stages. At the first stage, the malicious nodes are detected depending upon the destination sequence number without using encryption and decryption. Authentication is checked using public key cryptography in the second stage, which provides less computational complexity. The comparison of the proposed algorithm with other secure routing protocols using the National Choi Tung University (NCTUns) simulator has been done. The proposed scheme in this research has the capability of preventing malicious attacks like tracking location, manipulation, impersonation, wrong information, Sybil, replay, and DOS, and it also supports traditional security needs and traceability. The main advantage of our proposed algorithm is that it uses a short key length leading to speedy encryption, and it consumes less power. Although there is a little disadvantage associated, it increases the size of encrypted text, yet security is not compromised. The result shows that throughput increases by 25% in the proposed algorithm, numbers of collisions are lesser, and packet drop is reduced by 15%. The results prove that this novel proposed algorithm is more effective in a sparse vehicular environment, is lightweight and secure, and finds applications in e-health care, smart ecosystem, and intelligent transportation systems, etc.</p
    corecore